The exact synthesis of 1- and 2-qubit Clifford+T circuits
نویسنده
چکیده
We describe a new method for the decomposition of an arbitrary n qubit operator with entries in Z[i, 1 √ 2 ], i.e., of the form a+b √ 2+i(c+d √ 2) √ 2 k , into Clifford+T operators where n ≤ 2. This method achieves a bound of O(k) gates using at most one ancilla using decomposition into 1and 2-level matrices which was first proposed by Giles and Selinger in [2].
منابع مشابه
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring Z[ 1 √ 2 , i], in the single-qubit case. We report an efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used. We conjecture that the equivalence of the sets of unitaries implementabl...
متن کاملExact synthesis of multi-qubit Clifford+T circuits
We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[ 1 √ 2 , i]. Moreover, we show that one ancilla always suffices. These facts were conjectured by Kliuchnikov, Maslov, and Mosca. We obtain an algorithm for synthesizing a exact Clifford+T circuit from any such n-qubit operator. We also characte...
متن کاملExact Synthesis of Single-qubit Unitaries over Clifford-cyclotomic Gate Sets
We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input an exactly synthesizable single-qubit unitary–one which can be expressed without error as a product of Clifford and T gates–and outputs a sequence of gates which implements it. The algorithm is optimal i...
متن کاملRemarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators
Matsumoto and Amano (2008) showed that every single-qubit Clifford+T operator can be uniquely written of a particular form, which we call the Matsumoto-Amano normal form. In this mostly expository paper, we give a detailed and streamlined presentation of Matsumoto and Amano’s results, simplifying some proofs along the way. We also point out some corollaries to Matsumoto and Amano’s work, includ...
متن کاملNew methods for Quantum Compiling
The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and important problems on quantum computers. In my work I focus on the new methods for compiling single qubit operations that appear in many quantum algorithms into single qubit operations natively supported by sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1408.6202 شماره
صفحات -
تاریخ انتشار 2014